keeSeek: searching distant non-existing words in genomes for PCR-based applications
نویسندگان
چکیده
منابع مشابه
keeSeek: searching distant non-existing words in genomes for PCR-based applications
UNLABELLED The search for short words that are absent in the genome of one or more organisms (neverwords, also known as nullomers) is attracting growing interest because of the impact they may have in recent molecular biology applications. keeSeek is able to find absent sequences with primer-like features, which can be used as unique labels for exogenously inserted DNA fragments to recover thei...
متن کاملSearching for drug targets in microbial genomes.
Comparative analysis of the complete genome sequences of 10 bacterial pathogens available in the public databases offers the first insights into the drug discovery approaches of the near future. Genes that are conserved in different genomes often turn out to be essential, which makes them attractive targets for new broad-spectrum antibiotics. Subtractive genome analysis reveals the genes that a...
متن کاملSearching for repeated words in a
We present in this paper an algorithm that locates similar words common to a set of strings deened over an alphabet , where the similarity is stated in terms of a Levenshtein edit distance. The comparison of the words in the strings is realized by using a reference object called a model which is a word over. This allows us to perform a multiple comparison of the strings as opposed to pairwise c...
متن کاملShape-based searching for product lifecycle applications
Estimates suggest that more than 75% of engineering design activity comprises reuse of previous design knowledge to address a new design problem. Reusing design knowledge has great potential to improve product quality, shorten lead time, and reduce cost. However, PLM systems, which address the issue of reuse by searching for keywords in filenames, part numbers or context attached to CAD models,...
متن کاملSyDiG: uncovering Synteny in Distant Genomes
Current methods for detecting synteny work well for genomes with high degrees of inter- and intra-species chromosomal homology, such as mammals. This paper presents a new algorithm for synteny computation that is well suited to genomes covering a large evolutionary span. It is based on a three-step process: identification of initial microsyntenic homologous regions, extension of homologous boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2014
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btu312